Algebras of Minimal Rank over Arbitrary Fields
نویسنده
چکیده
Let R(A) denote the rank (also called bilinear complexity) of a nite dimensional associative algebra A. A fundamental lower bound for R(A) is the so-called Alder{Strassen bound R(A) 2 dim A?t, where t is the number of maximal twosided ideals of A. The class of algebras for which the Alder{Strassen bound is sharp, the so-called algebras of minimal rank, has received a wide attention in algebraic complexity theory. As the main contribution of this work, we characterize all algebras of minimal rank over arbitrary elds. This nally solves an open problem in algebraic complexity theory, see for instance 12, Sect. 12, Problem 4] or 6, Problem 17.5].
منابع مشابه
Algebras of Minimal Rank over Perfect Fields
Let R(A) denote the rank (also called bilinear complexity) of a finite dimensional associative algebra A. A fundamental lower bound for R(A) is the so-called Alder– Strassen boundR(A) 2 dimA t, where t is the number of maximal twosided ideals of A. The class of algebras for which the Alder–Strassen bound is sharp, the so-called algebras of minimal rank, has received a wide attention in algebrai...
متن کاملMultiplication over Arbitrary Fields
We prove a lower bound of 52n2 3n for the rank of n n–matrix multiplication over an arbitrary field. Similar bounds hold for the rank of the multiplication in noncommutative division algebras and for the multiplication of upper triangular matrices.
متن کاملA 5/2 n2-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields
We prove a lower bound of 52n 2 3n for the rank of n n–matrix multiplication over an arbitrary field. Similar bounds hold for the rank of the multiplication in noncommutative division algebras and for the multiplication of upper triangular matrices.
متن کاملFull-diversity, high-rate space-time block codes from division algebras
We present some general techniques for constructing full-rank, minimal-delay, rate at least one space–time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field embedded in matrix rings. The first half of the paper deals with constr...
متن کاملMultiplicative Complexity of Commutative Group Algebras over Algebraically Closed Fields
We determine structure and multiplicative complexity of commutative group algebras over algebraically closed fields. Commutative group algebra A of dimension n over algebraically closed field is isomorphic to B, where B is a superbasic algebra of minimal rank (see [5] for definition), and t is maximal that t | n, p t. Multiplicative and bilinear complexity of A equal to 2n − t.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003